Constraint Solving for Bounded-Process Cryptographic Protocol Analysis Jonathan Millen and Vitaly Shmatikov Computer Science Laboratory, SRI International, Menlo Park, CAUSA fmillen,

Source URL: jonmillen.com

Approximate Policy Iteration with Demonstration Data Beomjoon Kim School of Computer Science McGill University Montreal, Quebec, Canada

Source URL: www.sologen.net

Peter Snyder Department of Computer Science University of Illinois at Chicago Chicago, IL 60607

Source URL: www.peteresnyder.com

• Computing
• Internet
• Information and communications technology
• Terms of service
• Computer network security
• Internet privacy
• Browser security
• Privacy
• Tor
• Association for Computing Machinery
• Internet security

Two Ways of Discovering the Size and Shape of a Computer Program to Solve a Problem John R. Koza Computer Science Department Stanford University

Source URL: www.genetic-programming.com

Fitting Smooth Surfaces to Dense Polygon Meshes Venkat Krishnamurthy Marc Levoy Computer Science Department Stanford University

Source URL: graphics.stanford.edu

Science of Computer Programming–165 www.elsevier.com/locate/scico Type inference against races Cormac Flanagan a,∗ , Stephen N. Freund b a Computer Science Department, University of California at Santa

Source URL: dept.cs.williams.edu

Modelling and Verification of Web Services Business Activity Protocol Anders P. Ravn, Jiˇr´ı Srba? , and Saleem Vighio?? Department of Computer Science, Aalborg University, Selma Lagerl¨ ofs Vej 300, DK-9220 Aalborg

Source URL: www.it.uu.se

Practical everlasting privacy Myrto Arapinis1 , V´eronique Cortier2 , Steve Kremer2 , and Mark Ryan1 1 School of Computer Science, University of Birmingham 2

Source URL: www.cs.bham.ac.uk.

Learning Deep Neural Network Policies with Continuous Memory States Marvin Zhang, Zoe McCarthy, Chelsea Finn, Sergey Levine, Pieter Abbeel Department of Electrical Engineering and Computer Science, UC Berkeley {zhangmarv

Source URL: www.thespermwhale.com